many-many correspondence meaning in Chinese

多多对应

Taking attributed scattering center - based classification as example , the computation of feature likelihood function under many - many and 1 - 1 correspondence are studied , by using the algorithm of bipartite graph perfect matching to find the optimal 1 - 1 correspondence , the computation efficiency is improved greatly , the relations of likelihood function between 1 - 1 and many - many correspondence are analyzed , and two sub - optimal methods of calculating the likelihood function of 1 - 1 correspondence are presented
本章以基于属性散射中心特征的分类为例，深入研究了多?多对应和1 ? 1对应特征似然函数的计算，通过将求解二分图最佳匹配的算法用于寻找特征之间的最优1 ? 1对应关系，有效提高了1 ? 1对应特征似然函数的计算效率，分析了1 ? 1对应和多?多对应特征似然函数之间的关系，给出了两种次优的1 ? 1对应特征似然函数计算方法。